Termination w.r.t. Q proof of TRS/SK902.59.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(g(x), y, y) → g(f(x, x, y))

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(g(x), y, y) → g(f(x, x, y))

Q is empty.

We use [23] with the following order to prove termination.

Lexicographic path order with status [19].
Quasi-Precedence:

f₃ > g₁

Status:

f₃: [3,1,2]
g₁: [1]